Efficient matrix key homomorphic encryption of medical images

نویسندگان

چکیده

A sure way of providing privacy to sensitive images is encrypt them, especially when they are stored in a public cloud server. Homomorphic encryption enables arithmetic operations over encrypted data without access the secret key. This facility can be well harnessed for secure outsourced image processing by exploiting available computational capabilities modern servers. paper presents new homomorphic scheme that uses integer matrix keys. The carried out finite field Zp avail advantages and limit cipher text sizes reasonable levels. Our method does not use any error vector as learning with errors (LWE) improve security.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient fully homomorphic encryption with circularly secure key switching process

Fully homomorphic encryption (FHE) has important applications in cloud computing. However, almost all fully homomorphic encryption schemes share two common flaws that they all use large-scale secret keys and some operations inefficient. In this paper, the “special b” variant of the Learning With Errors problem (bLWE) is presented, and helps us construct the first circularly secure key switching...

متن کامل

Efficient Secure Matrix Multiplication over Lwe-based Homomorphic Encryption

Homomorphic encryption enables various calculations while preserving the data confidentiality. In this paper, we apply the somewhat homomorphic encryption scheme proposed by Brakerski and Vaikuntanathan (CRYPTO 2011) to secure matrix multiplication between two matrices. To reduce both the ciphertext size and the computation cost, we propose a new method to pack a matrix into a single ciphertext...

متن کامل

Efficient Integer Vector Homomorphic Encryption

Homomorphic Encryption yields deliberately malleable ciphertext, allowing operations on encrypted data. We outline and implement a homomorphic encryption scheme as suggested by Zhou and Wornell [1] that encrypts integer vectors to allow computation of arbitrary polynomials in the encrypted domain with a bounded degree. This finds applications particularly in cloud computation, when one is inter...

متن کامل

Homomorphic Encryption: From Private-Key to Public-Key

We show how to transform any additively homomorphic privatekey encryption scheme that is compact, into a public-key encryption scheme. By compact we mean that the length of a homomorphically generated encryption is independent of the number of ciphertexts from which it was created. We do not require anything else on the distribution of homomorphically generated encryptions (in particular, we do...

متن کامل

Securing Medical Images by Image Encryption using Key Image

This paper presents two methods for encryption and decryption of images using XOR operation. In the first method the original image is encrypted by the key image using XOR operation and decryption process also uses the same key image with XOR operation. In the second method one of the bit planes of the key image is used for encrypting the bit planes of the original image and shuffling is done f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indonesian Journal of Electrical Engineering and Computer Science

سال: 2023

ISSN: ['2502-4752', '2502-4760']

DOI: https://doi.org/10.11591/ijeecs.v31.i1.pp406-416